An Empirical Assessment of the Properties of Inverted Generational Distance on Multi- and Many-Objective Optimization

نویسندگان

  • Leonardo C. T. Bezerra
  • Manuel López-Ibáñez
  • Thomas Stützle
چکیده

The inverted generational distance (IGD) is a metric for assessing the quality of approximations to the Pareto front obtained by multi-objective optimization algorithms. The IGD has become the most commonly used metric in the context of many-objective problems, i.e., those with more than three objectives. The averaged Hausdorff distance and IGD are variants of the IGD proposed in order to overcome its major drawbacks. In particular, the IGD is not Pareto compliant and its conclusions may strongly change depending on the size of the reference front. It is also well-known that different metrics assign more importance to various desired features of approximation fronts, and thus, they may disagree when ranking them. However, the precise behavior of the IGD variants is not well-understood yet. In particular, IGD, the only IGD variant that is weakly Pareto-compliant, has received significantly less attention. This paper presents an empirical analysis of the IGD variants. Our experiments evaluate how these metrics are affected by the most important factors that intuitively describe the quality of approximation fronts, namely, spread, distribution and convergence. The results presented here already reveal interesting insights. For example, we conclude that, in order to achieve small IGD or IGD values, the approximation front size should match the reference front size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EMCSO: An Elitist Multi-Objective Cat Swarm Optimization

This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...

متن کامل

Pareto Optimal Design Of Decoupled Sliding Mode Control Based On A New Multi-Objective Particle Swarm Optimization Algorithm

One of the most important applications of multi-objective optimization is adjusting parameters ofpractical engineering problems in order to produce a more desirable outcome. In this paper, the decoupled sliding mode control technique (DSMC) is employed to stabilize an inverted pendulum which is a classic example of inherently unstable systems. Furthermore, a new Multi-Objective Particle Swarm O...

متن کامل

DYNAMIC PERFORMANCE OPTIMIZATION OF TRUSS STRUCTURES BASED ON AN IMPROVED MULTI-OBJECTIVE GROUP SEARCH OPTIMIZER

This paper presents an improved multi-objective group search optimizer (IMGSO) that is based on Pareto theory that is designed to handle multi-objective optimization problems. The optimizer includes improvements in three areas: the transition-feasible region is used to address constraints, the Dealer’s Principle is used to construct the non-dominated set, and the producer is updated using a tab...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017